the capacitated vehicle routing problem (cvrp) is a well-known combinatorial optimization problem that holds a central place in logistics management. the vehicle routing is an applied task in the industrial transportation for which an optimal solution will lead us to better services, save more time and ultimately increase in customer satisfaction. this problem is classified into np-hard problem...

stochastic approach to vehicle routing problem: development and theories abstract in this article, a chance constrained (ccp) formulation of the vehicle routing problem (vrp) is proposed. the reality is that once we convert some special form of probabilistic constraint into their equivalent deterministic form then a nonlinear constraint generates. knowing that reliable computer software for lar...

one of the important issues in transportation and logistics systems is vehicle routing problem (vrp). the vehicle routing problem is concerned with finding efficient routes of minimum total cost, beginning and ending at a central depot, for a fleet of vehicles to serve a number of customers. on the other hand, as a result of the increasing environmental concerns, economic problems and pressure ...

in this article, multiple-product pvrp with pickup and delivery that is used widely in goods distribution or other service companies, especially by railways, was introduced. a mathematical formulation was provided for this problem. each product had a set of vehicles which could carry the product and pickup and delivery could simultaneously occur. to solve the problem, two meta-heuristic methods...

Vehicle Routing Problem (VRP) is addressed to a class of problems for determining a set of vehicle routes, in which each vehicle departs from a given depot, serves a given set of customers, and returns back to the same depot. On the other hand, simultaneous delivery and pickup problems have drawn much attention in the past few years due to its high usage in real world cases. This study, therefo...

The single vehicle routing problem with multiple routes is a variant of the vehicle routing problem where the vehicle can be dispatched to several routes during its workday to serve a number of customers. In this paper we propose a goal programming model for multi-objective single vehicle routing problem with time windows and multiple routes. To solve the model, we present a heuristic method wh...

the inventory routing problem (irp) arises in the context of vendor-managed systems. this problem addresses jointly solving an inventory management problem and a vehicle routing problem. in this paper, we consider a multi-depot multi-vehicle inventory routing problem in which suppliers produce one type of product to be delivered to customers during a finite time horizon. we propose a two-phase ...

today, one of the new technologies in the modern era is vehicular ad-hoc network which has takenenormous attention in the recent years. because of rapid topology changing and frequent disconnectionmakes it difficult to design an efficient routing protocol for routing data between vehicles, called v2v orvehicle to vehicle communication and vehicle to roadside infrastructure, called v2i. designin...

In this article, multiple-product PVRP with pickup and delivery that is used widely in goods distribution or other service companies, especially by railways, was introduced. A mathematical formulation was provided for this problem. Each product had a set of vehicles which could carry the product and pickup and delivery could simultaneously occur. To solve the problem, two meta-heuristic methods...

Stochastic Approach to Vehicle Routing Problem: Development and Theories Abstract In this article, a chance constrained (CCP) formulation of the Vehicle Routing Problem (VRP) is proposed. The reality is that once we convert some special form of probabilistic constraint into their equivalent deterministic form then a nonlinear constraint generates. Knowing that reliable computer software...